Derangements and asymptotics of Laplace transforms of polynomials

نویسنده

  • Liviu I. Nicolaescu
چکیده

We describe the behavior as n → ∞ of the Laplace transforms of P, where P a fixed complex polynomial. As a consequence we obtain a new elementary proof of an result of Gillis-Ismail-Offer [2] in the combinatorial theory of derangements. 1 Statement of the main results The generalized derangement problem in combinatorics can be formulated as follows. Suppose X is a finite set and ∼ is an equivalence relation on X. For each x ∈ X we denote by x̂ the equivalence class of x. X̂∼ will denote the set of equivalence classes. The counting function of ∼ is the function ν = ν∼ : X̂ → Z, ν(x̂) = |x̂|. A ∼-derangement of x is a permutation φ : X → X such that x 6∈ x̂, ∀x ∈ X. We denote by N(X,∼) the number of ∼-derangements. The ratio p(X,∼) = N(X,∼) |X|! is the probability that a randomly chosen permutation of X is a derangement. In [1] S. Even and J. Gillis have described a beautiful relationship between these numbers and the Laguerre polynomials Ln(x) = ex n! dn dxn ( e−xxn ) = n ∑ k=0 ( n k ) (−x)k k! , n = 0, 1, · · · . For example L0(x) = 1, L1(x) = 1− x, L2(x) = x − 4x + 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 1 Ja n 20 04 Derangements and asymptotics of Laplace transforms of polynomials

We describe the behavior as n → ∞ of the Laplace transforms of Pn, where P a fixed complex polynomial. As a consequence we obtain a new elementary proof of an result of Gillis-Ismail-Offer [2] in the combinatorial theory of derangements. 1 Statement of the main results The generalized derangement problem in combinatorics can be formulated as follows. Suppose X is a finite set and ∼ is an equiva...

متن کامل

Derangements and asymptotics of the Laplace transforms of large powers of a polynomial

We use a probabilistic approach to produce sharp asymptotic estimates as n → ∞ for the Laplace transform of Pn, where P is a fixed complex polynomial. As a consequence we obtain a new elementary proof of a result of Askey-Gillis-Ismail-Offer-Rashed, [1, 3] in the combinatorial theory of derangements.

متن کامل

Complex Hermite Polynomials: from the Semi-circular Law to the Circular Law

We study asymptotics of orthogonal polynomial measures of the form |HN |2dγ where HN are real or complex Hermite polynomials with respect to the Gaussian measure γ. By means of differential equations on Laplace transforms, interpolation between the (real) arcsine law and the (complex) uniform distribution on the circle is emphasized. Suitable averages by an independent uniform law give rise to ...

متن کامل

Autoconvolution equations and generalized Mittag-Leffler ‎functions

This article is devoted to study of the autoconvolution equations and generalized Mittag-Leffler functions. These types of equations are given in terms of the Laplace transform convolution of a function with itself. We state new classes of the autoconvolution equations of the first kind and show that the generalized Mittag-Leffler functions are solutions of these types of equations. In view of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004